Vandermonde with Arnoldi
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 20 November 2019Accepted: 14 July 2020Published online: 06 May 2021Keywordsinterpolation, least-squares, Vandermonde matrix, Arnoldi, polyval, polyfit, Fourier extensionAMS Subject Headings41A05, 65D05, 65D10Publication DataISSN (print): 0036-1445ISSN (online): 1095-7200Publisher: Society for Industrial and Applied MathematicsCODEN: siread
منابع مشابه
Vandermonde Matrices with Chebyshev Nodes
For n × n Vandermonde matrix Vn = (αi−1 j )1≤i j≤n with translated Chebyshev zero nodes, it is discovered that V T n admits an explicit QR decomposition with the R-factor consisting of the coefficients of the translated Chebyshev polynomials of degree less than n. This decomposition then leads to an exact expression for the condition number of its submatrix Vk,n = (αi−1 j )1≤i≤k,1≤j≤n (so-calle...
متن کاملVandermonde sets and super-Vandermonde sets
Given a set T ⊆ GF(q), |T | = t, wT is defined as the smallest positive integer k for which ∑ y∈T y k 6= 0. It can be shown that wT ≤ t always and wT ≤ t − 1 if the characteristic p divides t. T is called a Vandermonde set if wT ≥ t−1 and a super-Vandermonde set if wT = t. This (extremal) algebraic property is interesting for its own right, but the original motivation comes from finite geometri...
متن کاملAccurate computations with Said-Ball-Vandermonde matrices
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0, 1), then those matrices are strictly totally positive. An algorithm for computing the bidiagonal decomposition of those Said-Ball-Vandermonde matrices is presented, which allows to use known algorithms for totally positive mat...
متن کاملOn Vandermonde Varieties
Motivated by the famous Skolem-Mahler-Lech theorem we initiate in this paper the study of a natural class of determinantal varieties, which we call Vandermonde varieties. They are closely related to the varieties consisting of all linear recurrence relations of a given order possessing a non-trivial solution vanishing at a given set of integers. In the regular case, i.e., when the dimension of ...
متن کاملArnoldi-Tikhonov regularization methods
Tikhonov regularization for large-scale linear ill-posed problems is commonly implemented by determining a partial Lanczos bidiagonalization of the matrix of the given system of equations. This paper explores the possibility of instead computing a partial Arnoldi decomposition of the given matrix. Computed examples illustrate that this approach may require fewer matrix-vector product evaluation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Review
سال: 2021
ISSN: ['1095-7200', '0036-1445']
DOI: https://doi.org/10.1137/19m130100x